KKT Proximity Measure Versus Augmented Achievement Scalarization Function
نویسندگان
چکیده
منابع مشابه
Coincidence point and common fixed point results via scalarization function
The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. Next, we obtain cone $b$-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.
متن کاملHow to measure achievement motivation ?
Introduction The selection of the right persons for a job is decisive for the success of a business, as it determines the working performance of the employees and to a large extent their job satisfaction, motivation and commitment. As a result, efforts are made, above all in Englishspeaking countries, to supplement the subjective impression from the job interview with standardised "objective" a...
متن کاملSense Proximity versus Sense Relations
It has been widely assumed that sense distinctions in WordNet are often too fine-grained for applications such as Machine Translation, Information Retrieval, Text Classification, Document clustering, Question Answering, etc. This has led to a number of studies in sense clustering, i.e., collapsing sense distinctions in WordNet that can be ignored for most practical applications [1,5,6]. At the ...
متن کاملAn integrative proximity measure for ontology alignment∗
Integrating heterogeneous resources of the web will require finding agreement between the underlying ontologies. A variety of methods from the literature may be used for this task, basically they perform pair-wise comparison of entities from each of the ontologies and select the most similar pairs. We introduce a similarity measure that takes advantage of most of the features of OWL-Lite ontolo...
متن کاملA Proximity Measure using Blink Model
This paper proposes a new graph proximity measure. This measure is a derivative of network reliability. By analyzing its properties and comparing it against other proximity measures through graph examples, we demonstrate that it is more consistent with human intuition than competitors. A new deterministic algorithm is developed to approximate this measure with practical complexity. Empirical ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018917986